#include<cstdio>//uncle-lu
#include<queue>
#include<algorithm>
template<class T>
void read(T &x)
{
	x=0;bool f=false;char ch=getchar();
	while(ch<'0'||ch>'9'){f|=(ch=='-');ch=getchar();}
	while(ch<='9'&&ch>='0'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
	x = f ? -x : x;
	return ;
}


struct Heap_node{
	int u,val;
	friend bool operator<(const Heap_node a,const Heap_node b)
	{
		return a.val>b.val;
	}
};
std::priority_queue<Heap_node>q;

int n,m,k;
bool flag[10010];


int main()
{
	freopen("in","r",stdin);

	read(n);read(m);read(k);
	int x,y,val;
	for(int i=1;i<=n;++i) { read(val); if(val)flag[i]=true; }

	for(int i=1;i<=m;++i)
	{

	}
	fclose(stdin);
	return 0;
}
